Relational Parametricity and Separation Logic
نویسندگان
چکیده
Separation logic is a recent extension of Hoare logic for reasoning about programs with references to shared mutable data structures. In this paper, we provide a new interpretation of the logic for a programming language with higher types. Our interpretation is based on Reynolds’s relational parametricity, and it provides a formal connection between separation logic and data abstraction.
منابع مشابه
Two for the Price of One: Lifting Separation Logic Assertions
Recently, data abstraction has been studied in thecontext of separation logic, with noticeable practicalsuccesses: the developed logics have enabled cleanproofs of tricky challenging programs, such as subject-observer patterns, and they have become the basis of ef-ficient verification tools for Java (jStar), C (VeriFast)and Hoare Type Theory (Ynot). In this paper, we giv...
متن کاملCategorical Models for Abadi - Plotkin ’ s Logic for Parametricity LARS BIRKEDAL
We propose a new category-theoretic formulation of relational parametricity based on a logic for reasoning about parametricity given by Abadi and Plotkin (Plotkin and Abadi, 1993). The logic can be used to reason about parametric models, such that we may prove consequences of parametricity that to our knowledge have not been proved before for existing category-theoretic notions of relational pa...
متن کاملA Logic for Parametric Polymorphism
In this paper we introduce a logic for parametric polymorphism. Just as LCF is a logic for the simply-typed -calculus with recursion and arithmetic, our logic is a logic for System F. The logic permits the formal presentation and use of relational parametricity. Parametricity yields|for example|encodings of initial algebras, nal co-algebras and abstract datatypes, with corresponding proof princ...
متن کاملSubtyping and Parametricity
In this paper we study the interaction of subtyping and parametricity. We describe a logic for a programming language with parametric polymorphism and subtyping. The logic supports the formal definition and use of relational parametricity. We give two models for it, and compare it with other formal systems for the same language. In particular, we examine the “Penn interpretation” of subtyping a...
متن کاملRelational Parametricity for Polymorphic Session Types
We introduce a theory of polymorphic concurrent processes, which arises from an interpretation of second-order intuitionistic linear logic propositions as polymorphic session types, in the style of the Girard-Reynolds polymorphic λ-calculus. The interpretation naturally generalizes recent discoveries on the correspondence between linear logic propositions and session types. In our proposed theo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Logical Methods in Computer Science
دوره 4 شماره
صفحات -
تاریخ انتشار 2007